Discrete Optimization for Shape Matching
نویسندگان
چکیده
We propose a novel discrete solver for optimizing functional map-based energies, including descriptor preservation and promoting structural properties such as area-preservation, bijectivity Laplacian commutativity among others. Unlike the commonly-used continuous optimization methods, our approach enforces map to be associated with pointwise correspondence hard constraint, which provides stronger link between optimized of point-to-point maps. Under this obtains maps lower energy values compared standard strategies. Perhaps more importantly, recovered from preserve are thus higher overall quality. demonstrate advantages on range energies shape categories, existing techniques within framework. Finally, in hand, we introduce Effective Functional Map Refinement (EFMR) method achieves state-of-the-art accuracy SHREC'19 benchmark.
منابع مشابه
An Optimization Method for Elastic Shape Matching
This note addresses the following shape matching problem: given a ‘template’ shape, numerically described by means of a computational mesh, and a ‘target’ shape, known only via a signed distance function to its boundary, we aim at deforming iteratively the mesh of the template shape into a computational mesh of the target shape. To achieve this goal, we rely on techniques from shape optimizatio...
متن کاملTwo-Dimensional Discrete Shape Matching and Recognition
We present a 2D matching method based on corresponding shape outlines. By working in discrete space, our study is done by using discrete operators and avoids interpolations and approximations. To encode shapes, we polygonalize their contours and we proceed by the extraction of intrinsic properties namely length, curvature and normal vectors. We optimize then a measure of similarity controlled b...
متن کاملDiscrete Minimum Distortion Correspondence Problems for Non-rigid Shape Matching
Similarity and correspondence are two fundamental archetype problems in shape analysis, encountered in numerous application in computer vision and pattern recognition. Many methods for shape similarity and correspondence boil down to the minimum-distortion correspondence problem, in which two shapes are endowed with certain structure, and one attempts to find the matching with smallest structur...
متن کاملShape-Matching Model Optimization Using Discrete-point Sampling and Feature Salience
The component classification and potential fault region locating in the full-automatic inspection system of a freight train require a computer vision method with the ability of classifying quickly and locating precisely, addressing anti-nonlinear deformations, and being able to perform extensible learning. Inspired by these requirements, this paper specifically optimizes the three elements of a...
متن کاملA Hyperelastic Two-Scale Optimization Model for Shape Matching
We suggest a novel shape matching algorithm for three-dimensional surface meshes of disk or sphere topology. The method is based on the physical theory of nonlinear elasticity and can hence handle large rotations and deformations. Deformation boundary conditions that supplement the underlying equations are usually unknown. Given an initial guess, these are optimized such that the mechanical bou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2021
ISSN: ['1467-8659', '0167-7055']
DOI: https://doi.org/10.1111/cgf.14359